Linear generalized semi-monadic rewrite systems effectively preserve recognizability
نویسندگان
چکیده
منابع مشابه
Right - linear finite path overlapping rewrite systems effectively preserve recognizability ∗
Right-linear finite path overlapping TRS are shown to effectively preserve recognizability. The class of right-linear finite path overlapping TRS properly includes the class of linear generalized semimonadic TRS and the class of inverse left-linear growing TRS, which are known to effectively preserve recognizability.
متن کاملDoes o-Substitution Preserve Recognizability?
Substitution operations on tree series are at the basis of systems of equations (over tree series) and tree series transducers. Tree series transducers seem to be an interesting transformation device in syntactic pattern matching. In this contribution, it is shown that o-substitution preserves recognizable tree series provided that the target tree series is linear and the semiring is idempotent...
متن کاملRecognizability of Redexes for Higher-Order Rewrite Systems
It is known that the set of all redexes for a left-linear term rewriting system is recognizable by a tree automaton, which means that we can construct a tree automaton that accepts redexes. The present paper extends this result to Nipkow’s higher-order rewrite systems, in which every left-hand side is a linear fully-extended pattern. A naive extension of the first-order method causes the automa...
متن کاملEffectively Monadic Predicates
Monadic predicates play a prominent role in many decidable cases, including decision procedures for symbolic automata. We are here interested in discovering whether a formula can be rewritten into a Boolean combination of monadic predicates. Our setting is quantifier-free formulas over a decidable background theory, such as arithmetic and we here develop a semi-decision procedure for extracting...
متن کاملBottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems
Coquidt, J.-L., M. Dauchet, R. Gilleron and S. VBgviilgyi, Bottom-up tree pushdown automata: classification and connection with rewrite systems, Theoretical Computer Science 127 (1994) 69-98. We define different types of bottom-up tree pushdown automata and study their connections with rewrite systems. Along this line of research we complete and generalize the results of Gallier, Book and Salom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00333-7